Does Algorithmic Probability Solve the Problem of Induction? Ray Solomonoff Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma,

Source URL: www.raysolomonoff.com

Powerpoint-presentation Information and Computing Sciences

Source URL: usefulpatterns.org

• Theoretical computer science
• Theory of computation
• Algorithmic information theory
• Computability theory
• Academia
• Randomness
• Turing machine
• Kolmogorov complexity
• Algorithmically random sequence
• Algorithmic probability
• Minimum description length
• Complexity

2 Complexity in the Universe Charles H. Bennett IBM Research Division, T . J. Watson Research Center Yorktown Heights, NYUSA.

Source URL: cqi.inf.usi.ch

• Information theory
• Theoretical computer science
• Randomness
• Metaphysics
• Knowledge
• Algorithmic information theory
• Thermodynamic entropy
• Theory of computation
• Complexity
• Kolmogorov complexity
• Algorithmic probability
• Entropy

Powerpoint-presentation Information and Computing Sciences

Source URL: www.usefulpatterns.org

• Algorithmic information theory
• Computability theory
• Randomness
• Theoretical computer science
• Turing machine
• Kolmogorov complexity
• Algorithmically random sequence
• Algorithmic probability
• Minimum description length
• Complexity
• Ray Solomonoff
• Algorithm

Spectral Distribution of Pseudo-random Matrices Vahid Tarokh Harvard University, USA Abstract In the previous century, much work has been done on the spectra of random matrices. However, not much is known about the spect

Source URL: seta2012.uwaterloo.ca

• Randomness
• Statistical randomness
• Probability theory
• Random matrices
• Algorithmic information theory
• Randomness tests
• Matrix
• Random sequence
• Pseudorandomness
• Random matrix
• Exchangeable random variables
• Circular law

Algorithmic Transparency via Quantitative Input Influence: Theory and Experiments with Learning Systems Anupam Datta Shayak Sen

Source URL: www.andrew.cmu.edu

• Statistics
• Mathematical analysis
• Statistical theory
• Probability
• Probability theory
• Regression analysis
• Probability distribution
• Expected value
• Conditional probability
• Random variable
• Joint probability distribution
• Errors and residuals

Towards a Universal Theory of Artificial Intelligence based on Algorithmic Probability and Sequential Decisions Marcus Hutter IDSIA, Galleria 2, CH-6928 Manno-Lugano, Switzerland, ?

Source URL: www.hutter1.de

RESEARCH STATEMENT JOHANNA N.Y. FRANKLIN As an applied computability theorist, I focus on algorithmic randomness, or the study of points in a probability space that are typical with respect to the measure on the space. I

Source URL: www.math.uconn.edu

Algorithmic Construction of Low-Discrepancy Point Sets via Dependent Randomized Rounding Benjamin Doerra , Michael Gnewuchb , Magnus Wahlstr¨oma a Max-Planck-Institut f¨

Source URL: www.numerik.uni-kiel.de

• Mathematics
• Mathematical analysis
• Probability
• Quasirandomness
• Algorithms
• Randomized rounding
• Low-discrepancy sequence
• Chernoff bound
• Rounding
• Exponentiation
• Method of conditional probabilities

QUANTUM ALGORITHMIC ENTROPY ´ PETER GACS A BSTRACT. We extend algorithmic information theory to quantum mechanics, taking a universal semicomputable density matrix (“universal probability”) as a starting point, and

Source URL: www.cs.bu.edu